Generalized decomposability notions for first-order theories
نویسنده
چکیده
This paper introduces the notion of decomposability in an extension and relative decomposability for first-order theories. We describe several basic facts connected with these notions and formulate a criterion of relative decomposability.
منابع مشابه
The Algorithmic Complexity of Decomposability in Fragments of First-Order Logic
The research on applied logic in the mid 2000s has brought important methodological and algorithmic results on modularization of finitely axiomatizable logical theories. In particular, the research has been focused on the question whether logical theories have an inherent modular structure which could allow one to identify, in some sense, independent “components” in theories and use them as bui...
متن کاملSemanticWeb Basics in Logical Consideration
In this paper we study the operation of incremental data extraction from declarative knowledge bases and the problem of decomposability of data in such KBs, by viewing them as first-order logical theories. The operation of incremental data extraction is closely connected with query reformulation in information retrieval and data integration, while the decomposability problem is important in the...
متن کاملObstructions to Weak Decomposability for Simplicial Polytopes
Provan and Billera introduced notions of (weak) decomposability of simplicial complexes as a means of attempting to prove polynomial upper bounds on the diameter of the facet-ridge graph of a simplicial polytope. Recently, De Loera and Klee provided the first examples of simplicial polytopes that are not weakly vertex-decomposable. These polytopes are polar to certain simple transportation poly...
متن کاملHyperequivalence of Programs and Operators
Recent research in nonmonotonic logic programming has focused on different notions of program equivalence relevant for program optimization and modular programming. So far, most results concern the stable-model semantics. However, other semantics for logic programs are also of interest, especially the semantics of supported models which, when properly generalized, is closely related to a promin...
متن کاملSolved and unsolved problems in generalized notions of Connes amenability
We survey the recent investigations on (bounded, sequential) approximate Connes amenability and pseudo-Connes amenability for dual Banach algebras. We will discuss the core problems concerning these notions and address the signicance of any solutions to them to the development of the eld.
متن کامل